Beam search strategy for IPS Evaluation of structure-based heuristics
نویسندگان
چکیده
One needs to determine rst what is a natural preferred analysis. On the one hand, a selective ranking of alternatives seems to be the correct choice. Observationally, we remark that people impose rather strong restrictions on the preferred analyses they assign to an ambiguous sentence, which is often not even perceived as ambiguous. In some cases, speakers do not realize that a sentence is ambiguous and give it an incorrect interpretation. In some cases, speakers realize they have made a mistake only later on in the sentence or in the conversation. In these cases { the so called garden paths { it has been shown to be very di cult to recover the correct interpretation for the sentence (Bever 1970; Frazier 1978; Frazier and Rayner 1982; Mitchell 1987). Computationally, a program that returns all analyses, although certainly complete, is not satisfactory in practice as it would produce a considerable amount of irrelevant analyses.
منابع مشابه
A beam search implementation for the irregular shape packing problem
The paper investigates the irregular shape packing problem, also frequently referred to as the nesting problem. A review of the literature highlights two distinct approaches for representing the problem; as an order list of pieces to be packed that is decoded by a placement rule (construction heuristic), or as a layout where pieces have allocated coordinate positions on the stock sheet. The for...
متن کاملBeam search algorithms for the early/tardy scheduling problem with release dates
In this paper we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. We present several heuristic algorithms based on the beam search technique. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority eva...
متن کاملAn Effective Framework for Chinese Syntactic Parsing
This paper presents an effective framework for Chinese syntactic parsing, which includes two parts. The first one is a parsing framework, which is based on an improved bottom-up chart parsing algorithm, and integrates the idea of the beam search strategy of N best algorithm and heuristic function of A* algorithm for pruning, then get multiple parsing trees. The second is a novel evaluation mode...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملAn Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning An Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluate the spectrum of different search strategies to see whether separate-and-conquer rule learning algorithms are able to gain performance in terms of predictive accuracy or theory size by using more powerful search strat...
متن کامل